The Seventeenth International Conference on Principles and Practice of Constraint Programming ( CP 2011 ) Doctoral Program
نویسندگان
چکیده
s of Papers in the Main CP 2011 Conference A constraint based approach to cyclic RCPSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini Solving MAXSAT by Solving a Sequence of Simpler SAT Instances . . . . . . . . . . . . . . . . 98 Jessica Davies and Fahiem Bacchus Filtering Algorithms for Discrete Cumulative Problems with Over-loads of Resource . . . . . . . 99 Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu and Narendra Jussien Synthesis of Search Algorithms from High-level CP Models . . . . . . . . . . . . . . . . . . . . 100 Samir A. Mohamed Elsayed and Laurent Michel Revisiting the tree Constraint . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 Jean-Guillaume Fages and Xavier Lorca Grid-Based SAT Solving with Iterative Partitioning and Clause Learning . . . . . . . . . . . . . . 102 Antti Hyvärinen, Tommi Junttila and Ilkka Niemelä Constraint Reasoning and Kernel Clustering for Pattern Decomposition With Scaling . . . . . . . 103 Ronan Le Bras, Theodoros Damoulas, Ashish Sabharwal and Carla Gomes An Efficient Light Solver for Querying the Semantic Web . . . . . . . . . . . . . . . . . . . . . . 104 Vianney Le Clément De Saint-Marcq, Yves Deville and Christine Solnon Boolean Equi-propagation for Optimized SAT Encoding . . . . . . . . . . . . . . . . . . . . . . 105 Amit Metodi, Michael Codish, Vitaly Lagoon and Peter Stuckey Incorporating Variance in Impact-Based Search . . . . . . . . . . . . . . . . . . . . . . . . . . . 106 Serdar Kadioglu, Eoin O’Mahony, Philippe Refalo and Meinolf Sellmann Octagonal Domains for Continuous constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Marie Pelleau, Charlotte Truchet and Frederic Benhamou A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints . . . . . . . 108 Roger Kameugne, Laure Pauline Fotso, Joseph Scott and Youcheu Ngo-Kateu Pruning Rules for Constrained Optimisation for Conditional Preferences . . . . . . . . . . . . . . 109 Nic Wilson and Walid Trabelsi
منابع مشابه
Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings
It's coming again, the new collection that this site has. To complete your curiosity, we offer the favorite principles and practice of constraint programming cp 2009 15th international conference cp 2009 lisbon portugal september 20 24 2009 proceedings lecture notes in computer science book as the choice today. This is a book that will show you even new to old thing. Forget it; it will be right...
متن کاملPrinciples and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings
Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that will change your life to life better. It is the thing that will give you many things around the world and this universe, in the real world and here after. As what will be given by this principles and practice of constraint programming 14th international conference cp 2008...
متن کاملThe Seventeenth International Conference on Automated Planning and Scheduling (ICAPS-07)
116 AI MAGAZINE Copyright © 2008, Association for the Advancement of Artificial Intelligence. All rights reserved. ISSN 0738-4602 The International Conference on Automated Planning and Scheduling (ICAPS) is well established as the premier forum for researchers and practitioners in the area. The annual conference series was formed in 2003 through the merger of the International Conference on AI ...
متن کاملThe 15 th International Conference on Principles and Practice of Constraint Programming Doctoral Program
In this work we present a new algorithm, called 2-C3OP, that achieves 2-consistency in binary and non-normalized CSPs. This algorithm is a reformulation of 2-C3 algorithm and it performs the constraint checks bidirectionally using inference. The evaluation section shows that 2-C3OP achieve 2-consistency like 2-C3 and it is 40% faster and therefore it is able to prune more search space than AC3....
متن کاملCommented Bibliography on Dynamic Constraint Solving
This document is a commented bibliography on Dynamic Constraint Solving and some related topics. It is associated with a tutorial about the same topic that has been given by the authors at CP 2003 (Ninth International Conference on Principles and Practice of Constraint Programming), in Cork, Ireland. These authors are the only responsible for the commentaries that are associated with each refer...
متن کامل